﻿using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace Brainee.Search
{
  /// <summary>
  /// Uniform-cost search is similar to breadth-first search but expands the node with 
  /// lowest path cost.
  /// </summary>
  /// <remarks>
  /// It is complete and optimal if the cost of each step exceeds some positive bound E.
  /// </remarks>
  public class UniformCostStrategy : BestFirstStrategy
  {
    public UniformCostStrategy ()
      : base (s => s.PathCost)
    { }
  }
}
